Accelerated Point-Wise Maximum Approach to Approximate Dynamic Programming
نویسندگان
چکیده
In this article, we describe an approximate dynamic programming (ADP) approach to compute lower bounds on the optimal value function for a discrete time, continuous space, and infinite horizon setting. The iteratively constructs family of bounding functions by using so-called Bellman inequality. novelty our is that, at each iteration, aim that maximizes point-wise maximum taken with computed thus far. This leads nonconvex objective, propose gradient ascent algorithm find stationary points solving sequence convex optimization problems. We provide convergence guarantees interpretation how computation relates state-relevance weighting parameter appearing in related ADP approaches. demonstrate through numerical examples when compared existing approaches, computes tighter suboptimality comparable time.
منابع مشابه
The Linear Programming Approach to Approximate Dynamic Programming
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach “fits” a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We dev...
متن کاملAn approximate dynamic programming approach to solving dynamic oligopoly models
In this paper we introduce a new method to approximate Markov perfect equilibrium in large scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate best response operator using an approximate dynamic programming approach based on linear programming. W...
متن کاملAn Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the solution of the linear programming relaxation. Our computational study suggests: (a) the new heuristic produces high qu...
متن کاملAn Approximate Dynamic Programming Approach to Network Revenue Management
We develop an approximation algorithm for a dynamic capacity allocation problem with Markov modulated customer arrival rates. For each time period and each state of the modulating process, the algorithm approximates the dynamic programming value function using a concave function that is separable across resource inventory levels. We establish via computational experiments that our algorithm inc...
متن کاملDynamic programming approach to optimization of approximate decision rules
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number b, we consider b-decision rules that local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2022
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2021.3050440